Graph limits of random unlabelled k-trees
نویسندگان
چکیده
منابع مشابه
The height of random binary unlabelled trees
This extended abstract is dedicated to the analysis of the height of non-plane unlabelled rooted binary trees. The height of such a tree chosen uniformly among those of size n is proved to have a limiting theta distribution, both in a central and local sense. Moderate as well as large deviations estimates are also derived. The proofs rely on the analysis (in the complex plane) of generating fun...
متن کاملBranches in random recursive k-ary trees
In this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. We also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملAsymptotic study of families of unlabelled trees and other unlabelled graph structures
This thesis deals with the asymptotic analysis of diverse random graph structures, especially random trees. For this purpose, we consider the set of objects of fixed size n (where the size is mostly describing the number of vertices of a graph), and choose an object from it uniformly at random. We discuss properties of such a random representative, as the size n tends to infinity. All results a...
متن کاملDegrees in $k$-minimal label random recursive trees
This article describes the limiting distribution of the degrees of nodes has been derived for a kind of random tree named k-minimal label random recursive tree, as the size of the tree goes to infinity. The outdegree of the tree is equal to the number of customers in a pyramid marketing agency immediatly alluring
متن کاملbranches in random recursive k-ary trees
in this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. we also find the expectation of the number of nodes of a given outdegree in a branch of such trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2020
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548320000164